Finding a Shortest Odd Hole
نویسندگان
چکیده
An odd hole in a graph is an induced cycle with length greater than 3. In earlier paper (with Sophie Spirkl), solving longstanding open problem, we gave polynomial-time algorithm to test if has hole. We subsequently showed that, for every t , there whether contains of at least . this article, give that finds shortest hole, one exists.
منابع مشابه
Finding a smallest odd hole in a claw-free graph using global structure
A lemma of Fouquet implies that a claw-free graph contains an induced C5, contains no odd hole, or is quasi-line. In this paper we use this result to give an improved shortest-oddhole algorithm for claw-free graphs by exploiting the structural relationship between line graphs and quasi-line graphs suggested by Chudnovsky and Seymour’s structure theorem for quasi-line graphs. Our approach involv...
متن کاملTwo optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کاملFATES: Finding A Time dEpendent Shortest path
We model a moving object as a sizable physical entity equipped with GPS, wireless communication capability, and a computer. Based on a grid model, we develop a distributed system, FATES, to manage data for moving objects in a two-dimensional space. The system is used to provide time-dependent shortest paths for moving objects. The performance study shows that FATES yields shorter average trip t...
متن کاملFinding the K shortest hyperpaths
The K shortest paths problem has been extensively studied for many years. Efficient methods have been devised, and many practical applications are known. Shortest hyperpath models have been proposed for several problems in different areas, for example in relation with routing in dynamic networks. However, the K shortest hyperpaths problem has not yet been investigated. In this paper we present ...
متن کاملFinding the k Shortest Paths
We give algorithms for finding the k shortest paths (not required to be simple) connecting a pair of vertices in a digraph. Our algorithms output an implicit representation of these paths in a digraph with n vertices and m edges, in time O(m + n log n + k). We can also find the k shortest paths from a given source s to each vertex in the graph, in total time O(m+ n log n+ kn). We describe appli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2021
ISSN: ['1549-6333', '1549-6325']
DOI: https://doi.org/10.1145/3447869